A novel mathematical formulation for solving the dynamic and discrete berth allocation problem by using the Bee Colony Optimisation algorithm
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولGenetic Algorithm for Dynamic Berth Allocation Problem with Discrete Layout
Genetic Algorithm which is based on the Darwinian principle of natural selection has been successfully applied to Berth allocation problem (BAP), which can decide the ships’ berthing position and berthing time at a container terminal. Considering the service priority, handing time deciding variables, safety clearance, as well as the berths’ physical conditions, a dynamic berth allocation with d...
متن کاملA novel approach to resolve the Dynamic Discrete Berth Allocation Problem in a Container Terminal
In this paper, we are interested in the modeling and the resolution of the dynamic and discrete berth allocation problem which is noted DDBAP. To resolve this problem, we propose a heuristic approach of optimization which combines two concepts: agent and heuristics. This approach is based on the use of the multi-agent negotiation, the contract net protocol, and a set of heuristics such as the W...
متن کاملSolving the Airline Recovery Problem By Using Ant Colony Optimization
In this paper an Ant Colony (ACO) algorithm is developed to solve aircraft recovery while considering disrupted passengers as part of objective function cost. By defining the recovery scope, the solution always guarantees a return to the original aircraft schedule as soon as possible which means least changes to the initial schedule and ensures that all downline affects of the disruption are ...
متن کاملSolving Shortest Common Supersequence Problem Using Artificial Bee Colony Algorithm
The idea behind this work is to solve the Shortest Common Supersequence by using Artificial Bee Colony (ABC) Algorithm. This algorithm is considered as one of the newest nature-inspired swarm-based optimization algorithms and has a promising performance [6]. Shortest Common Supersequence is a classical problem in the field of strings and it is classified as NP-Hard problem [12]. Many algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Intelligence
سال: 2020
ISSN: 0924-669X,1573-7497
DOI: 10.1007/s10489-020-02062-y